Search results for "Unbounded nondeterminism"

showing 1 items of 1 documents

Nondeterministic operations on finite relational structures

1998

Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…

Discrete mathematicsFinite-state machineGeneral Computer ScienceComputer scienceLogicFormal languages (recognizable and context-free sets transducers)Unbounded nondeterminismMonad (functional programming)Symbolic computationHypergraphsFirst-order logicLogical theoryDecidabilityTheoretical Computer ScienceNondeterministic algorithmAlgebraDeterministic automatonFormal languageUniversal algebraEquivalence relationTree transducersRewritingComputer Science(all)Theoretical Computer Science
researchProduct